Huge multiway table problems
نویسندگان
چکیده
منابع مشابه
Huge Multiway Table Problems
Optimization over l×m× n integer threeway tables is NP-hard already for fixed l = 3, but solvable in polynomial time with both l,m fixed. Here we consider huge tables, where the variable dimension n is encoded in binary. Combining recent results on Graver bases and recent results on integer cones, we show how to handle such problems in polynomial time. We also show that a harder variant of the ...
متن کاملThe Huge Multiway Table Problem
Deciding the existence of an l×m×n integer threeway table with given linesums is NP-complete already for fixed l = 3, but is in P with both l,m fixed. Here we consider huge tables, where the variable dimension n is encoded in binary. Combining recent results on integer cones and Graver bases, we show that if the number of layer types is fixed, then the problem is in P, whereas if it is variable...
متن کاملSubgradient methods for huge-scale optimization problems
We consider a new class of huge-scale problems, the problems with sparse subgradients. The most important functions of this type are piece-wise linear. For optimization problems with uniform sparsity of corresponding linear operators, we suggest a very efficient implementation of subgradient iterations, which total cost depends logarithmically in the dimension. This technique is based on a recu...
متن کاملAnalysis of LP relaxations for multiway and multicut problems
We introduce in this paper an exact nonlinear formulation of the multiway cut problem. By simple linearizations of this formulation, we derive several well-known and new formulations for the problem. We further establish a connection between the multiway cut and the maximum-weighted independent set problem. This leads to the study of several instances of the multiway cut problem through the the...
متن کاملGreedy splitting algorithms for approximating multiway partition problems
Abstract. Given a system (V, T, f, k), where V is a finite set, T ⊆ V , f : 2 → R is a submodular function and k ≥ 2 is an integer, the general multiway partition problem (MPP) asks to find a k-partition P = {V1, V2, . . ., Vk} of V that satisfies Vi∩T 6= ∅ for all i and minimizes f(V1)+f(V2)+ · · ·+f(Vk), where P is a k-partition of V if (i) Vi 6= ∅, (ii) Vi ∩ Vj = ∅, i 6= j, and (iii) V1 ∪ V2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2014
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2014.07.003